________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        03.02.2010 22:25:36
Input Data from:  dataset171.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,062
Average f[i]   :4575
Average g[i,j] :1909,80392156863
Total demand   :15510
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 18
> Selected Move:	1480	1	-1	8	5500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1480


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 81
> Selected Move:	1830	1	-1	3	11500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1830


> New S[]: 
	
	 0  1  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 82
> Selected Move:	2500	1	-1	4	16500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 2500


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 91
> Selected Move:	3280	1	-1	5	23000


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3280


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 91
> Selected Move:	3870	3	2	19	24800


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  1  0  0  0  0  0  0  0  0  0  0  4    >new incumb.: 3870


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 78
> Selected Move:	3890	3	4	12	23800


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  4    >new incumb.: 3890


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 96
> Selected Move:	3890	4	19	3	23500


> New Y[]: 
	
	 2  3  0  4  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 99
> Selected Move:	3890	4	3	5	22500


> New Y[]: 
	
	 2  3  0  1  0  4  0  0  1  0  0  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 102
> Selected Move:	4095	1	-1	14	26500


> New Y[]: 
	
	 2  3  0  1  0  4  0  0  1  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 60
> Selected Move:	4760	3	3	11	24500


> New Y[]: 
	
	 2  3  0  0  0  4  0  0  1  0  0  1  1  0  1  0  0  0  0  1    >new incumb.: 4760


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 91
> Selected Move:	4770	3	5	16	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  1  0  4  0  0  1    >new incumb.: 4770


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 84
> Selected Move:	4790	3	19	17	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  1  0  4  1  0  0    >new incumb.: 4790


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 99
> Selected Move:	4790	4	16	8	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  4  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 103
> Selected Move:	4770	3	16	3	23500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  4  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 99
> Selected Move:	4770	4	8	3	24000


> New Y[]: 
	
	 2  3  0  4  0  0  0  0  1  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 96
> Selected Move:	4725	4	3	17	25100


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  1  1  0  1  0  0  4  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 63
> Selected Move:	4745	3	3	16	25100


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  1  0  1  0  1  4  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 76
> Selected Move:	4710	3	8	4	24600


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  1  0  1  4  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 86
> Selected Move:	4710	4	17	4	23700


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  0  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 102
> Selected Move:	4710	4	4	12	24900


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  4  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 78
> Selected Move:	4710	4	12	16	23000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  1  0  4  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 108
> Selected Move:	4780	3	11	3	25000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  0  0  0  1  0  1  0  4  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 78
> Selected Move:	4710	3	16	5	25000


> New Y[]: 
	
	 2  3  0  1  1  4  0  0  0  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 102
> Selected Move:	4680	3	5	8	24500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  4  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 91
> Selected Move:	4680	4	8	3	25000


> New Y[]: 
	
	 2  3  0  4  1  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 82
> Selected Move:	4680	3	3	16	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  0  1  0  1  0  4  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 88
> Selected Move:	4710	3	17	11	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  0  1  0  4  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 85
> Selected Move:	4730	3	16	19	24300


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  0  1  0  0  0  0  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 94
> Selected Move:	4730	4	19	4	24200


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  1  0  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 93
> Selected Move:	4730	4	4	8	23500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  4  0  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 107
> Selected Move:	4770	3	4	16	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  4  0  0  1  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 97
> Selected Move:	4760	3	16	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  4  0  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 100
> Selected Move:	4700	3	19	4	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  4  0  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 94
> Selected Move:	4710	3	5	16	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  4  0  0  1  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 91
> Selected Move:	4710	3	8	19	24800


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  1  0  1  0  0  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 88
> Selected Move:	4710	4	19	4	24700


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  0  0  0  1  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 88
> Selected Move:	4710	4	4	16	24000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  1  0  4  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 106
> Selected Move:	4700	3	16	5	24000


> New Y[]: 
	
	 2  3  0  0  1  4  0  0  0  0  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 108
> Selected Move:	4700	3	19	8	24500


> New Y[]: 
	
	 2  3  0  0  1  4  0  0  1  0  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 106
> Selected Move:	4660	3	5	17	24100


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  0  1  0  0  4  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 99
> Selected Move:	4660	4	17	4	23200


> New Y[]: 
	
	 2  3  0  0  4  0  0  0  1  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 109
> Selected Move:	4700	3	0	5	25000


> New Y[]: 
	
	 0  3  0  0  4  2  0  0  1  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 83
> Selected Move:	4710	3	4	9	24800


> New Y[]: 
	
	 0  3  0  0  0  2  0  0  1  4  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 84
> Selected Move:	4940	3	5	16	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  4  0  1  1  0  1  0  2  1  0  0    >new incumb.: 4940


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 74
> Selected Move:	4860	3	9	2	23500


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  1  0  0  1  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 97
> Selected Move:	4860	4	16	8	24000


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  2  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 91
> Selected Move:	4860	4	8	12	25000


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  1  0  0  1  2  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 76
> Selected Move:	4840	3	16	3	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  1  0  0  1  2  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 65
> Selected Move:	4840	4	12	3	23800


> New Y[]: 
	
	 0  3  4  2  0  0  0  0  1  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 89
> Selected Move:	4840	4	3	8	24000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  2  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 83
> Selected Move:	4812	4	8	11	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  1  0  0  2  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 61
> Selected Move:	4833	3	3	16	25100


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  1  0  0  2  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 74
> Selected Move:	4833	4	11	14	25100


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  1  0  0  1  1  0  2  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 80
> Selected Move:	4814	3	16	3	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  1  0  0  1  1  0  2  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 75
> Selected Move:	4730	3	3	4	24100


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  1  0  0  1  1  0  2  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 93
> Selected Move:	4730	4	14	4	23300


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  1  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 97
> Selected Move:	4850	3	2	9	24800


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  1  4  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 75
> Selected Move:	4850	4	4	8	24500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  2  4  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 81
> Selected Move:	4850	4	8	9	24800


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  4  2  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 80
> Selected Move:	4752	3	4	16	25800


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  4  2  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 60 #######################


> Neighbours evaluated; 73
> Selected Move:	4820	4	8	9	25500


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  2  4  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 61 #######################


> Neighbours evaluated; 85
> Selected Move:	4748	3	16	3	25500


> New Y[]: 
	
	 0  3  0  1  0  0  0  0  2  4  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 62 #######################


> Neighbours evaluated; 55
> Selected Move:	4795	4	8	3	25300


> New Y[]: 
	
	 0  3  0  2  0  0  0  0  1  4  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 63 #######################


> Neighbours evaluated; 78
> Selected Move:	4620	3	8	4	24800


> New Y[]: 
	
	 0  3  0  2  1  0  0  0  0  4  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,25

## ITERATION 64 #######################


> Neighbours evaluated; 80
> Selected Move:	4710	3	3	16	24500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  4  0  1  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,245

## ITERATION 65 #######################


> Neighbours evaluated; 88
> Selected Move:	4710	3	9	2	23000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,24

## ITERATION 66 #######################


> Neighbours evaluated; 111
> Selected Move:	4970	1	-1	19	28000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 67 #######################


> Neighbours evaluated; 106
> Selected Move:	4812	3	16	3	28300


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  0  0  0  1  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 68 #######################


> Neighbours evaluated; 92
> Selected Move:	4800	2	11	-1	24300


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 69 #######################


> Neighbours evaluated; 95
> Selected Move:	4800	4	3	4	24800


> New Y[]: 
	
	 0  3  4  1  2  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 70 #######################


> Neighbours evaluated; 89
> Selected Move:	4800	3	3	16	24800


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  0  1  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,255

## ITERATION 71 #######################


> Neighbours evaluated; 97
> Selected Move:	4800	4	4	16	24000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  1  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,25

## ITERATION 72 #######################


> Neighbours evaluated; 106
> Selected Move:	4780	3	14	11	24000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  0  0  0  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 73 #######################


> Neighbours evaluated; 103
> Selected Move:	4780	4	16	4	24800


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  1  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 74 #######################


> Neighbours evaluated; 94
> Selected Move:	4778	1	-1	14	28800


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  1  1  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,235

## ITERATION 75 #######################


> Neighbours evaluated; 98
> Selected Move:	4730	2	12	-1	24800


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  1  0  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 76 #######################


> Neighbours evaluated; 92
> Selected Move:	4750	3	4	12	24500


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  2  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 77 #######################


> Neighbours evaluated; 103
> Selected Move:	4750	4	12	11	24600


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  2  1  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 78 #######################


> Neighbours evaluated; 100
> Selected Move:	4750	4	11	14	24600


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  1  0  2  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 79 #######################


> Neighbours evaluated; 101
> Selected Move:	4750	4	14	16	23000


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  1  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 80 #######################


> Neighbours evaluated; 108
> Selected Move:	4770	3	17	8	24500


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  1  0  0  1  1  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 81 #######################


> Neighbours evaluated; 98
> Selected Move:	4770	4	16	8	25000


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  2  0  0  1  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 82 #######################


> Neighbours evaluated; 99
> Selected Move:	4730	3	8	17	25100


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  1  0  1  0  1  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 83 #######################


> Neighbours evaluated; 97
> Selected Move:	4750	4	17	19	24200


> New Y[]: 
	
	 0  3  4  0  0  0  0  0  0  0  0  1  1  0  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,19

## ITERATION 84 #######################


> Neighbours evaluated; 108
> Selected Move:	4892	1	-1	4	29200


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  0  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 85 #######################


> Neighbours evaluated; 107
> Selected Move:	4900	3	19	8	29000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  2  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,18

## ITERATION 86 #######################


> Neighbours evaluated; 85
> Selected Move:	5010	4	8	16	28500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  1  0  0  1  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 87 #######################


> Neighbours evaluated; 95
> Selected Move:	4963	3	4	3	29500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  1  0  0  1  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,18

## ITERATION 88 #######################


> Neighbours evaluated; 88
> Selected Move:	4886	4	16	3	29800


> New Y[]: 
	
	 0  3  4  2  0  0  0  0  1  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 89 #######################


> Neighbours evaluated; 85
> Selected Move:	4917	3	16	4	28800


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  1  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 90 #######################


> Neighbours evaluated; 84
> Selected Move:	4860	4	3	8	29000


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  2  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,195

## ITERATION 91 #######################


> Neighbours evaluated; 84
> Selected Move:	4849	3	8	5	28800


> New Y[]: 
	
	 0  3  4  1  1  2  0  0  0  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,2

## ITERATION 92 #######################


> Neighbours evaluated; 106
> Selected Move:	4900	3	3	19	27800


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  0  0  0  1  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 93 #######################


> Neighbours evaluated; 121
> Selected Move:	4811	3	19	16	28800


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  0  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,21

## ITERATION 94 #######################


> Neighbours evaluated; 115
> Selected Move:	4767	3	16	8	28300


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  1  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 95 #######################


> Neighbours evaluated; 100
> Selected Move:	4746	3	17	19	29300


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  1  0  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 96 #######################


> Neighbours evaluated; 94
> Selected Move:	4760	2	4	-1	24300


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  1  0  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 97 #######################


> Neighbours evaluated; 109
> Selected Move:	4730	3	5	4	24300


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  1  0  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 98 #######################


> Neighbours evaluated; 90
> Selected Move:	4730	4	4	8	24000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  2  0  0  1  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 99 #######################


> Neighbours evaluated; 92
> Selected Move:	4730	4	8	12	25000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  1  0  0  1  2  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 100 #######################


> Neighbours evaluated; 83
> Selected Move:	4730	4	12	19	24700


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  1  0  0  1  1  0  1  0  0  0  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 101 #######################


> Neighbours evaluated; 82
> Selected Move:	4730	3	8	17	23200


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  0  1  0  0  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 102 #######################


> Neighbours evaluated; 112
> Selected Move:	4752	3	11	3	25200


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  0  1  0  1  0  0  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 103 #######################


> Neighbours evaluated; 93
> Selected Move:	4780	3	19	16	25000


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  0  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,23

## ITERATION 104 #######################


> Neighbours evaluated; 91
> Selected Move:	4815	3	4	8	25500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  1  0  0  0  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 105 #######################


> Neighbours evaluated; 80
> Selected Move:	4750	4	16	3	25800


> New Y[]: 
	
	 0  3  4  2  0  0  0  0  1  0  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 106 #######################


> Neighbours evaluated; 79
> Selected Move:	4750	3	16	4	24800


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 107 #######################


> Neighbours evaluated; 95
> Selected Move:	4750	4	3	8	25000


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  2  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 108 #######################


> Neighbours evaluated; 92
> Selected Move:	4770	3	8	5	24800


> New Y[]: 
	
	 0  3  4  1  1  2  0  0  0  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,205

## ITERATION 109 #######################


> Neighbours evaluated; 111
> Selected Move:	4700	3	3	11	22800


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  0  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,2

## ITERATION 110 #######################


> Neighbours evaluated; 109
> Selected Move:	4730	3	5	8	23000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  2  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,195

## ITERATION 111 #######################


> Neighbours evaluated; 91
> Selected Move:	4750	3	11	16	25000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  2  0  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,19

## ITERATION 112 #######################


> Neighbours evaluated; 85
> Selected Move:	4762	3	8	19	25200


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  1  0  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 113 #######################


> Neighbours evaluated; 98
> Selected Move:	4743	3	14	11	25200


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  0  0  0  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,18

## ITERATION 114 #######################


> Neighbours evaluated; 99
> Selected Move:	4730	3	19	8	25000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  2  0  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 115 #######################


> Neighbours evaluated; 85
> Selected Move:	4730	4	8	16	24500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  1  0  0  1  1  0  0  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,17

## ITERATION 116 #######################


> Neighbours evaluated; 89
> Selected Move:	4755	3	4	3	25500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  1  0  0  1  1  0  0  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 117 #######################


> Neighbours evaluated; 85
> Selected Move:	4758	3	12	14	25500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  1  0  0  1  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,16

## ITERATION 118 #######################


> Neighbours evaluated; 82
> Selected Move:	4740	1	-1	4	30500


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  1  0  0  1  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,165

## ITERATION 119 #######################


> Neighbours evaluated; 78
> Selected Move:	4963	1	-1	12	34500


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  1  0  0  1  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,17

## ITERATION 120 #######################


> Neighbours evaluated; 84
> Selected Move:	4920	2	8	-1	29000


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  1  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,175

## ITERATION 121 #######################


> Neighbours evaluated; 97
> Selected Move:	4885	3	16	19	29200


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  1  1  0  1  0  0  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 122 #######################


> Neighbours evaluated; 91
> Selected Move:	4936	4	19	4	28800


> New Y[]: 
	
	 0  3  4  1  2  0  0  0  0  0  0  1  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 123 #######################


> Neighbours evaluated; 102
> Selected Move:	4825	3	19	8	29300


> New Y[]: 
	
	 0  3  4  1  2  0  0  0  1  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 124 #######################


> Neighbours evaluated; 83
> Selected Move:	4823	3	3	16	29300


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  1  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 125 #######################


> Neighbours evaluated; 91
> Selected Move:	4732	3	4	5	29300


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  1  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,2

## ITERATION 126 #######################


> Neighbours evaluated; 106
> Selected Move:	4710	3	16	3	29300


> New Y[]: 
	
	 0  3  4  1  0  2  0  0  1  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 127 #######################


> Neighbours evaluated; 101
> Selected Move:	4680	2	3	-1	23300


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  1  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 128 #######################


> Neighbours evaluated; 107
> Selected Move:	4700	3	17	4	24300


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  1  0  0  1  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 129 #######################


> Neighbours evaluated; 104
> Selected Move:	4730	3	5	17	24600


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  1  0  0  1  1  0  1  0  0  2  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,22

## ITERATION 130 #######################


> Neighbours evaluated; 88
> Selected Move:	4730	4	17	11	24100


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  1  0  0  2  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,225

## ITERATION 131 #######################


> Neighbours evaluated; 89
> Selected Move:	4750	3	11	16	24500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  1  0  0  0  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,23

## ITERATION 132 #######################


> Neighbours evaluated; 85
> Selected Move:	4730	3	12	11	24500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  1  0  0  1  0  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,225

## ITERATION 133 #######################


> Neighbours evaluated; 85
> Selected Move:	4730	4	16	8	25000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  2  0  0  1  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,22

## ITERATION 134 #######################


> Neighbours evaluated; 75
> Selected Move:	4730	3	16	3	25000


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  2  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 135 #######################


> Neighbours evaluated; 92
> Selected Move:	4730	4	8	3	24800


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  1  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 136 #######################


> Neighbours evaluated; 94
> Selected Move:	4730	3	3	12	24000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  1  0  0  1  2  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 137 #######################


> Neighbours evaluated; 92
> Selected Move:	4748	3	2	9	25500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  4  0  1  2  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0 
 > pw :0,2

## ITERATION 138 #######################


> Neighbours evaluated; 81
> Selected Move:	4730	4	12	11	25600


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  4  0  2  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0 
 > pw :0,195

## ITERATION 139 #######################


> Neighbours evaluated; 80
> Selected Move:	4733	4	11	14	25600


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  4  0  1  1  0  2  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0 
 > pw :0,19

## ITERATION 140 #######################


> Neighbours evaluated; 86
> Selected Move:	4670	3	14	16	26000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  4  0  1  1  0  0  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 141 #######################


> Neighbours evaluated; 82
> Selected Move:	4845	1	-1	14	30000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  1  4  0  1  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,19

## ITERATION 142 #######################


> Neighbours evaluated; 86
> Selected Move:	4733	3	16	3	30300


> New Y[]: 
	
	 0  3  0  2  1  0  0  0  1  4  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0 
 > pw :0,195

## ITERATION 143 #######################


> Neighbours evaluated; 74
> Selected Move:	4668	4	3	8	30500


> New Y[]: 
	
	 0  3  0  1  1  0  0  0  2  4  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0 
 > pw :0,2

## ITERATION 144 #######################


> Neighbours evaluated; 72
> Selected Move:	4670	3	3	16	30500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  2  4  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,205

## ITERATION 145 #######################


> Neighbours evaluated; 82
> Selected Move:	4581	4	8	4	30800


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  1  4  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 146 #######################


> Neighbours evaluated; 79
> Selected Move:	4647	2	8	-1	25300


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  0  4  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,215

## ITERATION 147 #######################


> Neighbours evaluated; 83
> Selected Move:	4710	3	9	2	23800


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,22

## ITERATION 148 #######################


> Neighbours evaluated; 104
> Selected Move:	4730	3	16	19	22800


> New Y[]: 
	
	 0  3  4  0  2  0  0  0  0  0  0  1  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 149 #######################


> Neighbours evaluated; 105
> Selected Move:	4730	4	4	11	23600


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  2  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 150 #######################


> Neighbours evaluated; 109
> Selected Move:	4730	4	11	12	23500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  2  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 151 #######################


> Neighbours evaluated; 109
> Selected Move:	4730	4	12	14	23600


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  0  2  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 152 #######################


> Neighbours evaluated; 108
> Selected Move:	4730	4	14	17	24100


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  0  1  0  0  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 153 #######################


> Neighbours evaluated; 108
> Selected Move:	4710	3	17	16	24000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,23

## ITERATION 154 #######################


> Neighbours evaluated; 104
> Selected Move:	4730	3	12	17	24000


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  0  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 155 #######################


> Neighbours evaluated; 101
> Selected Move:	4685	4	16	19	25200


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  0  0  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 156 #######################


> Neighbours evaluated; 93
> Selected Move:	4710	3	19	12	24500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  2  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,215

## ITERATION 157 #######################


> Neighbours evaluated; 102
> Selected Move:	4723	1	-1	19	29500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  2  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 158 #######################


> Neighbours evaluated; 101
> Selected Move:	4724	4	12	11	29600


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  2  1  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,205

## ITERATION 159 #######################


> Neighbours evaluated; 96
> Selected Move:	4747	4	11	14	29600


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  0  2  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,2

## ITERATION 160 #######################


> Neighbours evaluated; 103
> Selected Move:	4710	2	19	-1	24600


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  1  0  2  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,195

## ITERATION 161 #######################


> Neighbours evaluated; 100
> Selected Move:	4710	4	14	11	24600


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  2  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,19

## ITERATION 162 #######################


> Neighbours evaluated; 99
> Selected Move:	4723	3	11	3	25300


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  0  0  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,195

## ITERATION 163 #######################


> Neighbours evaluated; 95
> Selected Move:	4762	1	-1	11	29300


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  0  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,2

## ITERATION 164 #######################


> Neighbours evaluated; 92
> Selected Move:	4730	3	3	0	27000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,205

## ITERATION 165 #######################


> Neighbours evaluated; 94
> Selected Move:	4853	3	2	8	28500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  4  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 166 #######################


> Neighbours evaluated; 102
> Selected Move:	4835	4	8	16	28500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  0  1  0  4  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 167 #######################


> Neighbours evaluated; 100
> Selected Move:	4815	3	8	19	28000


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  1  1  0  1  0  4  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 168 #######################


> Neighbours evaluated; 114
> Selected Move:	4720	3	17	8	29500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  0  1  0  4  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 169 #######################


> Neighbours evaluated; 92
> Selected Move:	4708	2	11	-1	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  0  1  0  1  0  4  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 170 #######################


> Neighbours evaluated; 92
> Selected Move:	4705	4	16	8	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  4  0  0  0  1  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 171 #######################


> Neighbours evaluated; 101
> Selected Move:	4683	3	14	11	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  4  0  0  1  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 172 #######################


> Neighbours evaluated; 92
> Selected Move:	4680	4	8	16	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  1  0  0  0  4  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 173 #######################


> Neighbours evaluated; 95
> Selected Move:	4668	3	16	5	25500


> New Y[]: 
	
	 2  3  0  0  1  4  0  0  1  0  0  1  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 174 #######################


> Neighbours evaluated; 104
> Selected Move:	4685	3	11	14	25500


> New Y[]: 
	
	 2  3  0  0  1  4  0  0  1  0  0  0  1  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 175 #######################


> Neighbours evaluated; 103
> Selected Move:	4613	3	12	11	25500


> New Y[]: 
	
	 2  3  0  0  1  4  0  0  1  0  0  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 176 #######################


> Neighbours evaluated; 103
> Selected Move:	4626	3	5	12	25400


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  4  0  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 177 #######################


> Neighbours evaluated; 95
> Selected Move:	4660	3	19	17	24400


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  0  0  1  4  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,27

## ITERATION 178 #######################


> Neighbours evaluated; 100
> Selected Move:	4682	3	4	16	25400


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  1  4  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 179 #######################


> Neighbours evaluated; 99
> Selected Move:	4660	3	16	3	25400


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  1  4  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0 
 > pw :0,28

## ITERATION 180 #######################


> Neighbours evaluated; 89
> Selected Move:	4630	3	12	16	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  1  0  0  1  0  4  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,285

## ITERATION 181 #######################


> Neighbours evaluated; 81
> Selected Move:	4718	3	11	12	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  0  1  0  1  0  4  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 182 #######################


> Neighbours evaluated; 81
> Selected Move:	4715	4	16	8	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  4  0  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 183 #######################


> Neighbours evaluated; 86
> Selected Move:	4680	3	3	4	24500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  4  0  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 184 #######################


> Neighbours evaluated; 95
> Selected Move:	4660	3	8	5	25000


> New Y[]: 
	
	 2  3  0  0  1  4  0  0  0  0  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 185 #######################


> Neighbours evaluated; 101
> Selected Move:	4660	3	16	11	23000


> New Y[]: 
	
	 2  3  0  0  1  4  0  0  0  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 186 #######################


> Neighbours evaluated; 112
> Selected Move:	4700	3	0	8	25000


> New Y[]: 
	
	 0  3  0  0  1  4  0  0  2  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,315

## ITERATION 187 #######################


> Neighbours evaluated; 81
> Selected Move:	4730	3	5	19	24800


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  2  0  0  1  1  0  1  0  0  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,32

## ITERATION 188 #######################


> Neighbours evaluated; 78
> Selected Move:	4730	4	8	19	24700


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  4  0  0  1  1  0  1  0  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,315

## ITERATION 189 #######################


> Neighbours evaluated; 82
> Selected Move:	4730	4	19	4	24300


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  4  0  0  1  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,31

## ITERATION 190 #######################


> Neighbours evaluated; 87
> Selected Move:	4750	3	4	16	24500


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  4  0  0  1  1  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,305

## ITERATION 191 #######################


> Neighbours evaluated; 93
> Selected Move:	4750	4	8	16	25000


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  2  0  0  1  1  0  1  0  4  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 192 #######################


> Neighbours evaluated; 91
> Selected Move:	4730	3	16	4	24700


> New Y[]: 
	
	 0  3  0  0  4  0  0  0  2  0  0  1  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,295

## ITERATION 193 #######################


> Neighbours evaluated; 89
> Selected Move:	4710	3	8	16	24700


> New Y[]: 
	
	 0  3  0  0  4  0  0  0  0  0  0  1  1  0  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,29

## ITERATION 194 #######################


> Neighbours evaluated; 53
> Selected Move:	4710	4	4	16	24800


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  0  0  0  1  1  0  1  0  4  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,285

## ITERATION 195 #######################


> Neighbours evaluated; 53
> Selected Move:	4653	4	4	19	25200


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  1  1  0  1  0  4  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,28

## ITERATION 196 #######################


> Neighbours evaluated; 46
> Selected Move:	4710	4	16	19	24800


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  0  0  0  1  1  0  1  0  2  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1 
 > pw :0,275

## ITERATION 197 #######################


> Neighbours evaluated; 53
> Selected Move:	4710	3	19	8	24500


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  4  0  0  1  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,27

## ITERATION 198 #######################


> Neighbours evaluated; 90
> Selected Move:	4710	4	8	16	25000


> New Y[]: 
	
	 0  3  0  0  1  0  0  0  2  0  0  1  1  0  1  0  4  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,265

## ITERATION 199 #######################


> Neighbours evaluated; 85
> Selected Move:	4631	4	8	4	25300


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  1  0  0  1  1  0  1  0  4  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,26

## ITERATION 200 #######################


> Neighbours evaluated; 76
> Selected Move:	4732	3	4	9	25800


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  2  0  1  1  0  1  0  4  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,255

## ITERATION 201 #######################


> Neighbours evaluated; 79
> Selected Move:	4723	3	16	4	25500


> New Y[]: 
	
	 0  3  0  0  4  0  0  0  1  2  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0 
 > pw :0,25

## ITERATION 202 #######################


> Neighbours evaluated; 77
> Selected Move:	4660	3	9	16	25200


> New Y[]: 
	
	 0  3  0  0  4  0  0  0  1  0  0  1  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,255

## ITERATION 203 #######################


> Neighbours evaluated; 84
> Selected Move:	4674	3	4	19	25300


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  0  0  1  1  0  1  0  2  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,26

## ITERATION 204 #######################


> Neighbours evaluated; 91
> Selected Move:	4704	3	16	4	25100


> New Y[]: 
	
	 0  3  0  0  2  0  0  0  1  0  0  1  1  0  1  0  0  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,265

## ITERATION 205 #######################


> Neighbours evaluated; 85
> Selected Move:	4624	4	4	19	25400


> New Y[]: 
	
	 0  3  0  0  4  0  0  0  1  0  0  1  1  0  1  0  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,27

## ITERATION 206 #######################


> Neighbours evaluated; 83
> Selected Move:	4561	3	4	16	25700


> New Y[]: 
	
	 0  3  0  0  0  0  0  0  1  0  0  1  1  0  1  0  4  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 207 #######################


> Neighbours evaluated; 82
> Selected Move:	4568	3	19	5	25300


> New Y[]: 
	
	 0  3  0  0  0  2  0  0  1  0  0  1  1  0  1  0  4  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,28

## ITERATION 208 #######################


> Neighbours evaluated; 92
> Selected Move:	4630	3	8	4	24800


> New Y[]: 
	
	 0  3  0  0  1  2  0  0  0  0  0  1  1  0  1  0  4  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0 
 > pw :0,285

## ITERATION 209 #######################


> Neighbours evaluated; 69
> Selected Move:	4700	3	16	8	24300


> New Y[]: 
	
	 0  3  0  0  1  2  0  0  4  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,29

## ITERATION 210 #######################


> Neighbours evaluated; 97
> Selected Move:	4700	3	8	9	24300


> New Y[]: 
	
	 0  3  0  0  1  2  0  0  0  4  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,295

## ITERATION 211 #######################


> Neighbours evaluated; 95
> Selected Move:	4612	4	5	9	25300


> New Y[]: 
	
	 0  3  0  0  1  4  0  0  0  2  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,3

## ITERATION 212 #######################


> Neighbours evaluated; 84
> Selected Move:	4630	3	9	16	25000


> New Y[]: 
	
	 0  3  0  0  1  4  0  0  0  0  0  1  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0 
 > pw :0,305

## ITERATION 213 #######################


> Neighbours evaluated; 67
> Selected Move:	4529	3	16	3	25300


> New Y[]: 
	
	 0  3  0  2  1  4  0  0  0  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,31

## ITERATION 214 #######################


> Neighbours evaluated; 46
> Selected Move:	4620	3	5	2	23300


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,315

## ITERATION 215 #######################


> Neighbours evaluated; 98
> Selected Move:	4730	3	14	8	24800


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 216 #######################


> Neighbours evaluated; 79
> Selected Move:	4730	4	3	8	25000


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  2  0  0  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 217 #######################


> Neighbours evaluated; 69
> Selected Move:	4690	3	8	16	25000


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  1  1  0  0  0  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,3

## ITERATION 218 #######################


> Neighbours evaluated; 81
> Selected Move:	4680	3	16	5	24800


> New Y[]: 
	
	 0  3  4  1  1  2  0  0  0  0  0  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,295

## ITERATION 219 #######################


> Neighbours evaluated; 106
> Selected Move:	4680	3	3	16	24800


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  0  0  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,29

## ITERATION 220 #######################


> Neighbours evaluated; 100
> Selected Move:	4700	3	11	14	24800


> New Y[]: 
	
	 0  3  4  0  1  2  0  0  0  0  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,285

## ITERATION 221 #######################


> Neighbours evaluated; 98
> Selected Move:	4650	3	4	11	23800


> New Y[]: 
	
	 0  3  4  0  0  2  0  0  0  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,28

## ITERATION 222 #######################


> Neighbours evaluated; 107
> Selected Move:	4660	3	5	3	24300


> New Y[]: 
	
	 0  3  4  2  0  0  0  0  0  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,275

## ITERATION 223 #######################


> Neighbours evaluated; 91
> Selected Move:	4680	3	16	19	23300


> New Y[]: 
	
	 0  3  4  2  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 224 #######################


> Neighbours evaluated; 101
> Selected Move:	4710	3	14	4	24300


> New Y[]: 
	
	 0  3  4  2  1  0  0  0  0  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 225 #######################


> Neighbours evaluated; 94
> Selected Move:	4710	4	3	4	24800


> New Y[]: 
	
	 0  3  4  1  2  0  0  0  0  0  0  1  1  0  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 226 #######################


> Neighbours evaluated; 93
> Selected Move:	4680	3	4	14	24600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  1  1  0  2  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 227 #######################


> Neighbours evaluated; 96
> Selected Move:	4680	4	14	11	24600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  2  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 228 #######################


> Neighbours evaluated; 94
> Selected Move:	4680	4	11	12	24500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  1  2  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 229 #######################


> Neighbours evaluated; 96
> Selected Move:	4680	4	12	19	24200


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 230 #######################


> Neighbours evaluated; 94
> Selected Move:	4662	3	14	4	25200


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  1  1  0  0  0  0  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 231 #######################


> Neighbours evaluated; 87
> Selected Move:	4620	3	19	14	24600


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  1  1  0  2  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,23

## ITERATION 232 #######################


> Neighbours evaluated; 93
> Selected Move:	4677	3	3	5	25100


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  0  0  1  1  0  2  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,225

## ITERATION 233 #######################


> Neighbours evaluated; 103
> Selected Move:	4700	4	14	4	24300


> New Y[]: 
	
	 0  3  4  0  2  1  0  0  0  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,22

## ITERATION 234 #######################


> Neighbours evaluated; 109
> Selected Move:	4700	4	4	12	25000


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  0  0  1  2  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,215

## ITERATION 235 #######################


> Neighbours evaluated; 106
> Selected Move:	4679	4	12	11	25100


> New Y[]: 
	
	 0  3  4  0  1  1  0  0  0  0  0  2  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,21

## ITERATION 236 #######################


> Neighbours evaluated; 107
> Selected Move:	4620	3	5	3	24600


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  2  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,205

## ITERATION 237 #######################


> Neighbours evaluated; 97
> Selected Move:	4677	1	-1	19	29600


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  2  1  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 238 #######################


> Neighbours evaluated; 88
> Selected Move:	4720	4	11	12	29500


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  1  2  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 239 #######################


> Neighbours evaluated; 91
> Selected Move:	4698	2	11	-1	25500


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  0  0  2  0  1  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 240 #######################


> Neighbours evaluated; 90
> Selected Move:	4695	3	3	16	25500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  2  0  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 241 #######################


> Neighbours evaluated; 94
> Selected Move:	4673	3	14	11	25500


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  1  2  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 242 #######################


> Neighbours evaluated; 93
> Selected Move:	4648	4	12	11	25600


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  2  1  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 243 #######################


> Neighbours evaluated; 89
> Selected Move:	4665	3	11	14	25600


> New Y[]: 
	
	 0  3  4  0  1  0  0  0  0  0  0  0  1  0  2  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,23
________________________________________________________________

Best solution found: 4940
Run Termination time: 03.02.2010 22:30:21
Run duration: 00:04:45.4062500
________________________________________________________________
